Lower Bound Sifting for MDDs
نویسندگان
چکیده
Decision Diagrams (DDs) are a data structure for the representation and manipulation of discrete logic functions often applied in VLSI CAD. Common DDs to represent Boolean functions are Binary Decision Diagrams (BDDs). Multiple-valued logic functions can be represented by Multiple-valued Decision Diagrams (MDDs). The efficiency of a DD representation strongly depends on the variable ordering; the size may vary from linear to exponential. Finding a good ordering is an NP-hard problem that has received considerable attention resulting in many minimization methods. Sifting is the most popular heuristic for dynamic DD minimization. In this paper we give lower bounds for sifting of MDDs. Based on them, both lower bound sifting for MDD minimization and lower bound group sifting for BDD minimization are proposed. By the computation of good lower bounds large parts of the search space can be pruned resulting in very fast computations. This is demonstrated by experimental results.
منابع مشابه
Augmented Sifting of Multiple-Valued Decision Diagrams
Discrete functions are now commonly represented by binary (BDD) and multiple-valued (MDD) decision diagrams. Sifting is an effective heuristic technique which applies adjacent variable interchanges to find a good variable ordering to reduce the size of a BDD or MDD. Linear sifting is an extension of BDD sifting where XOR operations involving adjacent variable pairs augment adjacent variable int...
متن کاملSelection of Efficient Re-Ordering Heuristics for MDD Construction
Multi-valued decision diagrams (MDDs) are a generalization of binary decision diagrams (BDDs). They are suitable for several applications in synthesis and verification of integrated circuits since often, functions with multi-valued input variables can be represented efficiently by MDDs. Their sizes counted in number of nodes vary from linear to exponential dependent on the variable ordering use...
متن کاملA Model Sifting Problem of Selberg
We study a model sifting problem introduced by Selberg, in which all of the primes have roughly the same size. We show that the Selberg lower bound sieve is asymptotically optimal in this setting, and we use this to give a new lower bound on the sifting limit βκ in terms of the sifting dimension κ. We also show that one can use a rounding procedure to improve on the Selberg lower bound sieve by...
متن کاملHeuristics to Minimize Multiple-Valued Decision Diagrams
In this paper, we propose a method to minimize multiple-valued decision diagrams (MDDs) for multipleoutput functions. We consider the following: (1) a heuristic for encoding the 2-valued inputs; and (2) a heuristic for ordering the multiple-valued input variables based on sampling, where each sample is a group of outputs. We first generate a 4-valued input 2-valued multiple-output function from...
متن کاملExact and Heuristic Minimization of Determinant Decision Diagrams
Determinant Decision Diagram (DDD) is a variant of binary decision diagrams (BDDs) for representing symbolic matrix determinants and cofactors in symbolic circuit analysis. DDD-based symbolic analysis algorithms have time and space complexities proportional to the number of DDD vertices. Inspired by the ideas of Rudell, Drechsler, et. al. on BDD minimization, we present lowerbound based exact a...
متن کامل